The linear congruence group modulo $n$

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Domino Tiling Congruence Modulo 4

The number of domino tilings of a region with reflective symmetry across a line is combinatorially shown to depend on the number of domino tilings of particular subregions, modulo 4. This expands upon previous congruency results for domino tilings, modulo 2, and leads to a variety of corollaries, including that the number of domino tilings of a k× 2k rectangle is congruent to 1 mod 4.

متن کامل

Fast Algorithms for Linear Algebra Modulo N

Many linear algebra problems over the ring ZZN of integers modulo N can be solved by transforming via elementary row operations an n ⇥ m input matrix A to Howell form H. The nonzero rows of H give a canonical set of generators for the submodule of (ZZN ) m generated by the rows of A. In this paper we present an algorithm to recover H together with an invertible transformation matrix P which sat...

متن کامل

Linear Codes Through Latin Squares Modulo n

It is known that t mutually orthogonal latin squares of order n generate a b t 2c-error correcting code with n codewords. In this paper we consider latin squares of order n made up of elements taken from Zn. In this situation we consider when this code is linear. We present neccessary and sufficient conditions on the latin squares and obtain a method of constructing a maximal family of mutually...

متن کامل

On a Congruence modulo a Prime

Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/page/info/about/policies/terms.jsp. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive o...

متن کامل

Adding distinct congruence classes modulo a prime

The Cauchy-Davenport theorem states that if A and B are nonempty sets of congruence classes modulo a prime p, and if |A| = k and |B| = l, then the sumset A + B contains at least min(p, k + l − 1) congruence classes. It follows that the sumset 2A contains at least min(p, 2k − 1) congruence classes. Erdős and Heilbronn conjectured 30 years ago that there are at least min(p, 2k − 3) congruence cla...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the American Mathematical Society

سال: 1952

ISSN: 0002-9939

DOI: 10.1090/s0002-9939-1952-0049887-5